Review of Explicit Allocation of Best-Effort Packet Delivery Service

نویسنده

  • Yadi Ma
چکیده

This paper proposed a preferential dropping algorithm and a tagging algorithm. The proposed twin RIO algorithms use two sets of parameters, one set for in packets and one for out packets. As in RED, RIO has three phases to determine dropping in the routers, normal operation, congestion avoidance and congestion control. The paper designed a TSW tagger, which is a profile meter for bulk-data transfer. The tagger estimates the TCP sending rate and based on this, a tagging algorithm tags packets as out when the traffic exceeds a certain threshold.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Explicit Allocation of Best-Effort Packet Delivery Service - Networking, IEEE/ACM Transactions on

This paper presents the “allocated-capacity” framework for providing different levels of best-effort service in times of network congestion. The “allocatedcapacity” framework—extensions to the Internet protocols and algorithms—can allocate bandwidth to different users in a controlled and predictable way during network congestion. The framework supports two complementary ways of controlling the ...

متن کامل

Resource Allocation for Interactive Traffic Class over Gprs

The General Packet Radio Service (GPRS) is a new bearer service for GSM that greatly simplify wireless access to packet data networks, e.g., to the Internet, to the corporate LAN or to the mobile portals. It applies a packet radio standard to transfer user data packets in a well-organized way between Mobile Stations (MS) and external packet data networks. The introduction of guaranteed performa...

متن کامل

An Efficient Scheme of General Weighted Fair Allocation for Enhanced Best-Effort Service in High Speed Networks

This research is focused on enhanced best-effort service, which provides the minimum bandwidth guarantee and distributes the available bandwidth fairly to packet flows in a high speed network. These goals can be reached when the bandwidth allocation is general weighted (GW) fair among the flows. GW fairness ensures the minimum rate for every flow and, furthermore, allocates the excess bandwidth...

متن کامل

Dynamic OFDMA Resource Allocation for QoS Guarantee and System Optimization of Best Effort and Non Real-time Traffic

To achieve the requirement of high data rate, low latency, user fairness for next generation wireless networks, proper designing of cross-layer optimized dynamic resource allocation algorithm is prerequisite. In this paper, we propose a dynamic resource allocation scheme in Orthogonal Frequency Division Multiple Access (OFDMA) systems to optimize the non real-time (NRT) traffic, which requires ...

متن کامل

Service Disciplines Performance for Best-Effort Policies in Packet-Switching Wireless Cellular Networks

In this paper, we investigate the performance of service disciplines for packet-switched wireless networks in the context of General Packet Radio Service (GPRS). The GPRS is a new additional GSM service, which provide packet switched data services over GSM network and a packet access to data networks. Using either best effort service or guaranteed performance service, the service discipline aff...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007